Performance comparison of a set of periodic and non-periodic tridiagonal solvers on SP2 and Paragon parallel computers

Various tridiagonal solvers have been proposed in recent years for di erent parallel platforms. In this paper, the performance of three tridiagonal solvers, namely, the parallel partition LU algorithm, the parallel diagonal dominant algorithm, and the reduced diagonal dominant algorithm, is studied. These algorithms are designed for distributed-memory machines and are tested on an Intel Paragon and an IBM SP2 machines. Measured results are reported in terms of execution time and speedup. Analytical study are conducted for di erent communication topologies and for di erent tridiagonal systems. The measured results match the analytical results closely. In addition to address implementation issues, performance considerations such as problem sizes and models of speedup are also discussed. This work was supported in part by the NationalAeronautics and Space Administration under NASA contract NAS1-1672 and byLouisiana Education Quality Support Fund. https://ntrs.nasa.gov/search.jsp?R=2004011042